A Solution of the P versus NP Problem
نویسنده
چکیده
Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev's function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP.
منابع مشابه
Does NP not equal P ? C
— Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is not of necessity equivalent to P, were it shown that SAT is contained in P. This due to a paradox, of nature addressed by both Gödel and Russell, in regar...
متن کاملInductive Complexity of the P versus NP Problem
This paper does not propose a solution, not even a new possible attack, to the P versusNP problem. We are asking the simpler question: How “complex” is the P versus NPproblem? Using the inductive complexity measure—a measure based on computationsrun by inductive register machines of various orders—developed in [2], we determine anupper bound on the inductive complexity of second...
متن کاملNP versus P : A proof that NP is not equaled to P
This proof of P ≠ NP is based on better estimates of lower bounds on the time complexity that hold for all solution algorithms. Almost no special knowledge is needed to understand the proof. A short review of the main steps and ideas of the proof can be seen in the Introduction below.
متن کاملA polynomial time solution for 2-SAT
The question of whether the P and NP complexity classes are equivalent is unresolved. It is conjectured that they are inequivalent because of the vast number of NP-Complete languages (including the ever-popular 3-SAT) for which there is no known polynomial time solution. The author of this paper respectfully disagrees and presents a polynomial time solution to a problem closely related to 3-SAT...
متن کاملThe Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P
This paper presents the differences between two NP problems. It focuses in the Euclidian 2 Dimension Travelling Salesman Problems and General Assign Problems. The main results are the triangle reduction to verify the solution in polynomial time for the former and for the later the solution to the Noted Conjecture of the NP-Class, NP is not P.
متن کاملIndependence of P vs. NP in regards to oracle relativizations
Previously in “P is a proper subset of NP” [Meek Article 1 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.03486 شماره
صفحات -
تاریخ انتشار 2017